All Questions
7 questions
4votes
1answer
1kviews
What is the most suitable data structure for IPv4 addresses with intersecting ranges?
Mostly in all routers and operating systems the Longest Prefix Match algorithm is used for searching the trie of IPv4 addresses. Packet filters like Iptables don't need some special data structure for ...
- 99
1vote
2answers
2kviews
How fuzzy search is implemented for file paths
Say I have file paths like this: my/long/directory/structure/index.js my/long/directory/structure2/index.js my/long/directory/structure3/index.js my/long/directory/structure.../index.js my/long/...
- 2,731
3votes
4answers
119views
Store csv data as rows or columns in view of the needed processing?
Assume I have some data a csv-Files like ObjectName, PropertyA, PropertyB, PropertyC "Name1", 3, 1, 4 "Name2", 1, 5, 9 "Name3", 2, 6, 5 ... and a typical question I want to answer would be For ...
7votes
1answer
738views
data structure/algorithm for conditional next step
I have been trying to find a proper way to represent the above data flow (this is just a small case), and I'm not sure if I found a good way to do it. Our current implementation just evaluate all the ...
-2votes
1answer
772views
Considerations when making data structure and algorithm choices [closed]
What are some reasons you may choose a worse runtime algorithm? And what are some advantages of a linked list vs a hash table/array where access is constant time.
3votes
1answer
571views
When designing a data structure, should I implement very inefficient operations for convenience?
(I've added the .NET tags because the data structures are for .NET, and this question should be considered in the context of the conventions for that platform.) I'm writing a library of immutable and ...
- 1,763
0votes
0answers
50views
Designing online exam [duplicate]
I need to design an online exam server for an exam like GRE in which question difficulty increases if you answer correctly and decreases if you answer wrong. Questions are multiple choice questions ...
- 101
